Diagonally non-computable functions and fireworks
نویسندگان
چکیده
منابع مشابه
Diagonally non-computable functions and fireworks
A set C of reals is said to be negligible if there is no probabilistic algorithm which generates a member of C with positive probability. Various classes have been proven to be negligible, for example the Turing upper-cone of a non-computable real, the class of coherent completions of Peano Arithmetic or the class of reals of minimal degrees. One class of particular interest in the study of neg...
متن کاملDiagonally non-computable functions and bi-immunity
We prove that every diagonally noncomputable function computes a set A which is bi-immune, meaning that neither A nor its complement has an infinite computably enumerable subset.
متن کاملJoining non-low C.E. sets with diagonally non-computable functions
We show that every non-low c.e. set joins all ∆2 diagonally noncomputable functions to ∅′. We give two proofs: a direct argument, and a proof using an analysis of functions that are DNC relative to an oracle, extending work by Day and Reimann. The latter proof is also presented in the language of Kolmogorov complexity.
متن کاملNon-Computable Functions in Optimality Theory
Is Optimality Theory a constraining theory? A formal analysis shows that it is, if two auxiliary assumptions are made: (1) that only markedness and faithfulness constraints are allowed, and (2) that input and output representations are made from the same elements. Such OT grammars turn out to be incapable of computing circular or infinite chain shifts. These theoretical predictions are borne ou...
متن کاملDiagonally Non - Recursive Functions and Effective Hausdorff Dimension
We prove that every sufficiently slow growing DNR function computes a real with effective Hausdorff dimension one. Using a proof recently published by Kumabe and Lewis, it follows that there is a real of dimension one and minimal degree. Note that such a real cannot compute a Martin-Löf random real.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2017
ISSN: 0890-5401
DOI: 10.1016/j.ic.2016.12.008